Liar’s Domination in Graphs
نویسنده
چکیده
A set D ⊆ V (G) of a graph G = (V,E) is a liar’s dominating set if (1) for all v ∈ V (G) |N [v] ∩ D| ≥ 2 and (2) for every pair u, v ∈ V (G) of distinct vertices, |N [u] ∪ N [v] ∩ D| ≥ 3. In this paper, we consider the liar’s domination number of some middle graphs. Every triple dominating set is a liar’s dominating set and every liar’s dominating set must be a double dominating set. So, the liar’s dominating set lies between double dominating set and triple dominating set.
منابع مشابه
Linear kernels for k-tuple and liar's domination in bounded genus graphs
A set D ⊆ V is called a k-tuple dominating set of a graph G = (V,E) if |NG[v] ∩D| ≥ k for all v ∈ V , where NG[v] denotes the closed neighborhood of v. A set D ⊆ V is called a liar’s dominating set of a graph G = (V,E) if (i) |NG[v] ∩D| ≥ 2 for all v ∈ V , and (ii) for every pair of distinct vertices u, v ∈ V , |(NG[u] ∪NG[v]) ∩D| ≥ 3. Given a graph G, the decision versions of k-Tuple Dominatio...
متن کاملHardness of Liar's Domination on Unit Disk Graphs
A unit disk graph is the intersection graph of a set of unit diameter disks in the plane. In this paper we consider liar’s domination problem on unit disk graphs, a variant of dominating set problem. We call this problem as Euclidean liar’s domination problem. In the Euclidean liar’s domination problem, a set P = {p1, p2, . . . , pn} of n points (disk centers) are given in the Euclidean plane. ...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملDomination and Signed Domination Number of Cayley Graphs
In this paper, we investigate domination number as well as signed domination numbers of Cay(G : S) for all cyclic group G of order n, where n in {p^m; pq} and S = { a^i : i in B(1; n)}. We also introduce some families of connected regular graphs gamma such that gamma_S(Gamma) in {2,3,4,5 }.
متن کاملDomination parameters of Cayley graphs of some groups
In this paper, we investigate domination number, $gamma$, as well as signed domination number, $gamma_{_S}$, of all cubic Cayley graphs of cyclic and quaternion groups. In addition, we show that the domination and signed domination numbers of cubic graphs depend on each other.
متن کامل